Processor Allocation for Parallel Execution
نویسندگان
چکیده
In this paper we explore an important issue, processor allocation, to improve the parallel execution of hash joins. To exploit the opportunity of pipelining for hash join execution, a scheme to transform a bushy execution tree to an allocation tree is rst devised. In an allocation tree, each node denotes a pipeline. Then, using the concept of synchronous execution time, processors are allocated to the nodes in the allocation tree in such a way that inner relations in a pipeline can be made available approximately the same time. Extensive performance studies are conducted via simulation to demonstrate the importance of processor allocation.
منابع مشابه
Ultra-Low-Energy DSP Processor Design for Many-Core Parallel Applications
Background and Objectives: Digital signal processors are widely used in energy constrained applications in which battery lifetime is a critical concern. Accordingly, designing ultra-low-energy processors is a major concern. In this work and in the first step, we propose a sub-threshold DSP processor. Methods: As our baseline architecture, we use a modified version of an existing ultra-low-power...
متن کاملPARALLEL EXECUTION OF HASH JOINS IN PARALLELDATABASESHui
In this paper we explore two important issues, processor allocation and the use of hash lters, to improve the parallel execution of hash joins. To exploit the opportunity of pipelining for hash join execution, a scheme to transform a bushy execution tree to an allocation tree is rst devised. In an allocation tree, each node denotes a pipeline. Then, using the concept of synchronous execution ti...
متن کاملUsing Utilization Pro les in Allocation and Partitioning for Multiprocessor Systems
The problems of multiprocessor partitioning and program allocation are interdependent and critical to the performance of multiprocessor systems Minimizing resource partitions for parallel programs on partitionable multiprocessors facilitates greater processor utilization and throughput The pro cessing resource requirements of parallel programs vary during program execution and are allocation de...
متن کاملProbabilistic Analysis of Scheduling Precedence Constrained Parallel Tasks on Multicomputers with Contiguous Processor Allocation
ÐGiven a set of precedence constrained parallel tasks with their processor requirements and execution times, the problem of scheduling precedence constrained parallel tasks on multicomputers with contiguous processor allocation is to find a nonpreemptive schedule of the tasks on a multicomputer such that the schedule length is minimized. This scheduling problem is substantially more difficult t...
متن کاملMigration with Dynamic Space - Sharing scheduling policies : The case of the SGI O 2000
In this paper, we claim that memory migration mechanism is a useful approach to improve the execution of parallel applications in dynamic execution environments, but that their performance depends on related system components such as the processor scheduling. To show that, we evaluate the automatic memory migration mechanism provided by IRIX in Origin systems, under different dynamic processor ...
متن کامل